Algorithms for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e99" altimg="si118.svg"><mml:mi>q</mml:mi></mml:math>-ary error-correcting codes with limited magnitude and feedback
نویسندگان
چکیده
Berlekamp and Zigangirov completely determined the capacity error function for binary correcting codes with noiseless feedback. It is still an unsolved problem if upper bound in non-binary case of Ahlswede, Lebedev, Deppe sharp. We consider wraparound channels limited magnitude determine all q -ary a level r . All our algorithms use partial Furthermore, special equivalent to Shannon’s zero-error problem.
منابع مشابه
Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors
The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .
متن کاملLinear covering codes and error-correcting codes for limited-magnitude errors
The concepts of a linear covering code and a covering set for the limitedmagnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcti...
متن کاملOptimal, systematic, q-ary codes correcting all asymmetric and symmetric errors of limited magnitude
Systematic -ary ( ) codes capable of correcting all asymmetric errors of maximum magnitude , where , are given. These codes are shown to be optimal. Further, simple encoding/decoding algorithms are described. The proposed code can be modified to design codes correcting all symmetric errors of maximum magnitude , where .
متن کاملOn q-ary codes correcting all unidirectional errors of a limited magnitude
We consider codes over the alphabet Q = {0, 1,. .. , q − 1} intended for the control of unidirectional errors of level ℓ. That is, the transmission channel is such that the received word cannot contain both a component larger than the transmitted one and a component smaller than the transmitted one. Moreover, the absolute value of the difference between a transmitted component and its received ...
متن کاملEvolutionary Algorithms for Optimal Error-Correcting Codes
The maximum possible number of codewords in a q-ary code of length n and minimum distance d is denoted Aq(n,d). It is a fundamental problem in coding theory to determine this value for given parameters q, n and d. Codes that attain the maximum are said to be optimal. Unfortunately, for many different values of these parameters, the maximum number of codewords is currently unknown: instead we ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112199